Parallelizable Elliptic Curve Point Multiplication Method with Resistance against Side-Channel Attacks
نویسنده
چکیده
We present a new 2-ary elliptic curve point multiplication method with resistance against side-channel attacks. This method provides two advantages compared with previous similar side-channel attack countermeasures: It avoids a fixed table, thus reducing potential information leakage available to adversaries; and it is easily parallelizable on two-processor systems, where it provides much improved performance.
منابع مشابه
Securing Elliptic Curve Point Multiplication against Side-Channel Attacks
For making elliptic curve point multiplication secure against side-channel attacks, various methods have been proposed using special point representations for specifically chosen elliptic curves. We show that the same goal can be achieved based on conventional elliptic curve arithmetic implementations. Our point multiplication method is much more general than the proposals requiring non-standar...
متن کاملImplementation of Elliptic Curve Cryptography with Built-In Counter Measures against Side Channel Attacks
Many software implementations of public key cryptosystems have been concerned with efficiency. The advent of side channel attacks, such as timing and power analysis attacks, force us to reconsider the strategy of implementation of group arithmetic. This paper presents a study of software counter measures against side channel attacks for elliptic curve cryptosystems. We introduce two new counter...
متن کاملA New Double Point Multiplication Method and its Implementation on Binary Elliptic Curves with Endomorphisms
Efficient and high-performance implementation of point multiplication is crucial for elliptic curve cryptosystems. In this paper, we present a new double point multiplication algorithm based on differential addition chains. We use our scheme to implement single point multiplication on binary elliptic curves with efficiently computable endomorphisms. Our proposed scheme has a uniform structure a...
متن کاملRetrieving Lost Efficiency of Scalar Multiplications for Resisting against Side-Channel Attacks
At the elliptic curve cryptosystems (ECC) implementation stage, a major concern is securing scalar multiplications against so-called side-channel attacks (SCA). Existing solutions reach the goal by inserting dummy operations (typically increase 33% computational costs) based on commonly-used binary method, which largely increases the computational costs and prohibits the deployment of ECC in co...
متن کاملFast Elliptic Curve Multiplications Resistant against Side Channel Attacks
This paper proposes fast elliptic curve multiplication algorithms resistant against side channel attacks, based on the Montgomerytype scalar multiplication. The proposed scalar multiplications can be applied to all curves over prime fields, e.g., any standardized curves over finite fields with characteristic larger than 3. The method utilizes the addition formulas xECDBL and xECADD assembled by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002